On Computing Schur Functions and Series Thereof
نویسندگان
چکیده
We present two new algorithms for computing all Schur functions sκ(x1, . . . ,xn) for partitions κ such that |κ| ≤ N. Both algorithms have the property that for nonnegative arguments x1, . . . ,xn the output is computed to high relative accuracy and the cost per Schur function is O(n2).
منابع مشابه
A Linear-time Algorithm for Evaluating Series of Schur Functions
We present a new algorithm for computing all Schur functions sλ(x1, x2, . . . , xn) for all partitions λ of integers not exceedingN in timeO(nKN ), whereKN ≡ #{λ| |λ| ≤ N} is the number of those partitions. In particular, this algorithm has optimal complexity for evaluating truncated series of Schur functions such as the hypergeometric function of a matrix argument.
متن کاملA Schur-Parlett Algorithm for Computing Matrix Functions
An algorithm for computing matrix functions is presented. It employs a Schur decomposition with reordering and blocking followed by the block form of a recurrence of Parlett, with functions of the nontrivial diagonal blocks evaluated via a Taylor series. A parameter is used to balance the conflicting requirements of producing small diagonal blocks and keeping the separations of the blocks large...
متن کاملProducts of Schur and Factorial Schur Functions
The product of any finite number of Schur and factorial Schur functions can be expanded as a Z[y]-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes the classical Littlewood-Richardson rule.
متن کاملProducts of Factorial Schur Functions
The product of any finite number of factorial Schur functions can be expanded as a Z[y]-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the Molev-Sagan rule, which in turn generalizes the classical Littlewood-Richardson rule.
متن کاملSome Remarks on the Characters of the General Lie Superalgebra
Berele and Regev [1] defined the ring of hook Schur functions and showed that these functions are the characters of the general Lie superalgebra. Since the introduction of the hook Schur functions they have been extensively studied with respect to their combinatorial properties [2], [3], [4]. We compute the Hilbert series of this ring by giving a generating function for the partitions which fit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008